An Effective Framework for Path Planning Amidst Movable Obstacles
نویسندگان
چکیده
This paper addresses the problem of navigating an autonomous moving entity in an environment with both stationary and movable obstacles. If a movable obstacle blocks the path of the entity attempting to reach its goal configuration, the entity is allowed to alter the placement of the obstacle by manipulation (e.g. pushing or pulling), to clear its path. This paper presents a probabilistically complete framework for solving path planning problems among movable obstacles. Heuristics are presented to provide efficient solutions for problems in environments encountered in practical situations.
منابع مشابه
5] v. Lumelsky and A. Stepanov. Path-planning Strategies for a Point Mobile Automaton Moving amidst Unknown Obstacles of Arbitrary Shape. Figure 22: Pushing Plan for the Real-world Experiment
Motion planning for a robot and a movable object amidst polygonal obstacles. A new geometrical approach to planing manipulation tasks. the case of a circular robot and a movable circular object amidst polygonal obstacles. Figure 23: The problem of rotational pushing. (A) describes a square object aligned to the grid. The dots show all possible (discretized) conngurations that the robot can take...
متن کاملMotion planning for a robot and a movable object amidst polygonal obstacles
This paper addresses t h e m o t i o n planning problem for a robot and a movable object amidst polygonal obstacles. M o t i o n planning in this context appears as a constrained instance of t h e coordinated m o t i o n planning problem for t w o robots. Indeed, the object cannot move by itself, at only does when the robot grasps at. W e f irs t show a topological property tha t characterizes ...
متن کاملHeuristic Motion Planning with Movable Obstacles
We present a heuristic approach to geometric path planning with movable obstacles. Treating movable obstacles as mobile robots leads to path planing problems with many degrees of freedom which are intractable. Our strategy avoids this computational complexity by decoupling the whole motion planning problem into a series of tractable problems, which are solved using known path planning algorithm...
متن کاملPlanning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design. In this paper we study the problem of planning high-quality paths. A high-quality path should have some desirable properties: it should be short and avoid long detours, and at the same time it should stay at a safe di...
متن کاملPlanning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximal velocities of the moving obstacles, the regions that are possibly not collision-free are modeled by discs that grow over time. We present an approach to compute the shortest path between two points in the plane that avoids these growing disc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006